Iterated sequential transducers as language generating devices
نویسندگان
چکیده
Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Iterated GSM Mappings: A Collapsing Hierarchy
With motivations from various areas (Lindenmayer systems, iterated reading of literary works, self-generated in nite sequences, \computing by carving" as suggested in the DNA computing area), in several places mechanisms based on iterated (non-deterministic) nite state sequential transducers were considered. It is known that such mechanisms can characterize the family of recursively enumerable ...
متن کاملInsertion operations: closure properties.dvi
The basic notions used for specifying languages are of algorithmic or operational character: automata (accepting devices) or grammars (generating devices). This duality reflects the original motivations coming from computer science or linguistics. A deeper theory and more involved proofs called for alternative definitional devices, where the operations have a classical mathematical character. E...
متن کاملOn the Model Checking of Sequential Reactive Systems
By sequential reactive system we mean a program which operates in the interaction with the environment permanently receiving data (requests) from it. At receiving a piece of data a program performs a sequence of actions (response) and displays the current result. Such programs usually arise at implementation of computer drivers, online algorithms, control procedures. Basic actions performed by ...
متن کامل“Dogmatic” P Systems
In this work we propose a variant of P systems based on the Central Dogma of Molecular Biology which establishes the transformation of DNA strands into protein products by applying different string transformation such as transductions and transcriptions. We introduce a new kind of worm object rules to carry out transducion operations. Finally, we establish the universality of the proposed model...
متن کاملCharacterisation of (Sub)sequential Rational Functions over a General Class Monoids
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be described in terms of natural algebraic axioms, contains the free monoids, groups, the tropical monoid, and is closed under Cartesian. 1 Inroduction The pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 369 شماره
صفحات -
تاریخ انتشار 2006